package com.fr.lintcode;

import java.util.Arrays;

public class Q1663 {
    /**
     * @param m: the limit
     * @param k: the sum of choose
     * @param arr: the array
     * @return: yes or no
     */
    public String depress(int m, int k, int[] arr) {
        // Write your code here.
    	Arrays.sort(arr);
    	int count = 0;
    	for(int i = 0 ; i < k; i++) {
    		count += arr[i];
    	}
    	if(count >= m) {
    		return "yes";
    	}else {
    		return "no";
    	}
    }
}
